Abstraction via Approximate Symmetry

ion via Approximate Symmetry Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ 08903 [email protected] LCSR-TR-199 Abstract Abstraction techniques are important for solving constraint satisfaction problems with global constraints and low solution density. In the presence of global constraints, backtracking search is unable to prune partial solutions. It therefore operates like pure generate-and-test. Abstraction improves on generate-and-test by enabling entire subsets of the solution space to be pruned early in a backtracking search process. This paper describes how abstraction spaces can be characterized in terms of approximate symmetries of the original, concrete search space. It de nes two special types of approximate symmetry, called \range symmetry" and \domain symmetry", which apply to function nding problems. It also presents algorithms for automatically synthesizing hierarchic problem solvers based on range or domain symmetry. The algorithms operate by analyzing declarative descriptions of classes of constraint satisfaction problems. Both algorithms have been fully implemented. This paper concludes by presenting data from experiments testing the two synthesis algorithms and the resulting problem solvers on NP-hard scheduling and partitioning problems.